Decomposition of complete multigraphs into stars and cycles
نویسندگان
چکیده
Let k be a positive integer, Sk and Ck denote, respectively, a star and a cycle of k edges. λKn is the usual notation for the complete multigraph on n vertices and in which every edge is taken λ times. In this paper, we investigate necessary and sufficient conditions for the existence of the decomposition of λKn into edges disjoint of stars Sk’s and cycles Ck’s.
منابع مشابه
Decomposition of complete bipartite multigraphs into paths and cycles having k edges
We give necessary and sufficient conditions for the decomposition of complete bipartite multigraph Km,n(λ) into paths and cycles having k edges. In particular, we show that such decomposition exists in Km,n(λ), when λ ≡ 0 (mod 2), m, n ≥ k2 , m + n > k, and k(p + q) = 2mn for k ≡ 0(mod 2) and also when λ ≥ 3, λm ≡ λn ≡ 0(mod 2), k(p + q) = λmn, m, n ≥ k, (resp., m,n ≥ 3k/2) for k ≡ 0(mod 4) (re...
متن کاملA decomposition of Gallai multigraphs
An edge-colored cycle is rainbow if its edges are colored with distinct colors. A Gallai (multi) graph is a simple, complete, edge-colored (multi) graph lacking rainbow triangles. As has been previously shown for Gallai graphs, we show that Gallai multigraphs admit a simple iterative construction. Moreover, we show that Gallai multigraphs give rise to a surprising and highly structured decompos...
متن کاملMultigraph decomposition into stars and into multistars
We study the decomposition of multigraphs with a constant edge multiplicity into copies of a fixed starH =K1,t :We present necessary and sufficient conditions for such a decomposition to exist where t = 2 and prove NP-completeness of the corresponding decision problem for any t 3.We also prove NP-completeness when the edge multiplicity function is not restricted either on the input G or on the ...
متن کاملDecomposing Semi-complete Multigraphs and Directed Graphs into Paths of Length Two
A P3-decomposition of a graph is a partition of the edges of the graph into paths of length two. We give a necessary and sufficient condition for a semi-complete multigraph, that is a multigraph with at least one edge between each pair of vertices, to have a P3-decomposition. We show that this condition can be tested in strongly polynomial-time, and that the same condition applies to a larger c...
متن کاملA note on uniformly resolvable decompositions of Kv and Kv-I into 2-stars and 4-cycles
In this paper we consider the uniformly resolvable decomposition of the complete graph Kv, or the complete graph minus a 1-factor Kv − I, into two graphs such that each resolution class contains only blocks isomorphic to the same graph. We completely solve the case in which the resolution classes are either all 2-stars or 4-cycles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 35 شماره
صفحات -
تاریخ انتشار 2015